Triangle-Based View Interpolation without Depth-Buffering

In this paper, we propose a triangle-based view interpolation algorithm which can correctly resolve the visibility problem without depth-buffering. The algorithm is especially useful when depth information is not available, such as in the case of real-world photographs. By subdividing the reference image into variable-sized triangles, view interpolation can be done efficiently using existing graphics hardware. We derive the drawing order between each pair of neighboring triangles from the epipolar geometry. Using this drawing order, a graph can be built and topological sorting is applied on the graph to obtain the complete drawing order of all triangles in linear time.